Discrete ordered median problem with induced order
نویسندگان
چکیده
منابع مشابه
Exact procedures for solving the discrete ordered median problem
The Discrete Ordered Median Problem (DOMP) generalizes classical discrete location problems, such as the N -median, N -center and Uncapacitated Facility Location problems. It was introduced by Nickel [16], who formulated it as both a nonlinear and a linear integer program. We propose an alternative integer linear programming formulation for the DOMP, discuss relationships between both integer l...
متن کاملHeuristic Procedures for Solving the Discrete Ordered Median Problem
We present two heuristic methods for solving the Discrete Ordered Median Problem (DOMP), for which no such approaches have been developed so far. The DOMP generalizes classical discrete facility location problems, such as the p-median, p-center and Uncapacitated Facility Location problems. The first procedure proposed in this paper is based on a genetic algorithm developed by Moreno Vega [MV96]...
متن کاملThe Ordered Median Euclidean Straight-line Location Problem
An optimal line is sought in the Euclidean plane in terms of the ordered median criterion, when the set of existing facilities are points with arbitrary positive associated weights. By way of geometric duality a dominating set for such a line is found. This allows the construction of an algorithm to solve the problem in O(n4).
متن کاملThe p-median Problem with Order for Two-Source Clustering
In this paper we present a hybrid approach to integrative clustering based on the p-median problem with clients’ preferences. We formulate the problem of simultaneous clustering of a set of objects, characterized by two sets of features, as a bi-level p-median model. An exact approach involving a branchand-cut method combined with the simulated annealing algorithm is used, that allows one to fi...
متن کاملSolving the ordered one-median problem in the plane
In this paper we propose a general approach solution method for the single facility ordered median problem in the plane. All types of weights (non-negative, non-positive, and mixed) are considered. The big triangle small triangle approach is used for the solution. Rigorous and heuristic algorithms are proposed and extensively tested on eight different problems with excellent results.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TOP
سال: 2020
ISSN: 1134-5764,1863-8279
DOI: 10.1007/s11750-020-00570-1